On the Fractal Beauty of Bin Packing
نویسندگان
چکیده
In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some xed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present the rst unbounded space algorithms for this problem. We also show the rst lower bounds on the asymptotic performance ratio. The case where bins of two sizes, 1 and 2 (0; 1), are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves. Note: Work carried out under theme SEN4 \Evolutionary Systems and Applied Algorithmics".
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملOn the Fractal
In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some xed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present the rst unbounded space algorithms for this problem. We also show the rst lower bounds on the asymptotic performance ratio. The case where bins of two sizes, 1 and 2 (0; 1), are ...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملبررسی تعدادی از روشهای آماری جهت ترسیم نمودار کنترل مشاهدات انفرادی برای فرایندهای اتورگرسیو
Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fu...
متن کاملBiased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version)
We study the Best Fit algorithm for on line bin packing under the distribution in which the item sizes are uniformly distributed in the discrete range f k k j kg Our main result is that in the case j k the asymptotic expected waste remains bounded This settles an open problem of Co man et al and involves a detailed analysis of the in nite multi dimensional Markov chain underlying the algorithm
متن کامل